0.11/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.11/0.13 % Command : run_E %s %d THM 0.13/0.34 % Computer : n015.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 960 0.13/0.34 % WCLimit : 120 0.13/0.34 % DateTime : Tue Aug 9 04:12:56 EDT 2022 0.13/0.34 % CPUTime : 0.20/0.47 Running higher-order on 8 cores theorem proving 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p 0.20/0.47 # Version: 3.0pre003-ho 0.20/0.49 # Preprocessing class: HSMSSMSSMLMNHSN. 0.20/0.49 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.49 # Starting ho_unfolding_3 with 600s (5) cores 0.20/0.49 # Starting ehoh_best2_full_lfho with 120s (1) cores 0.20/0.49 # Starting almost_fo_3_lam with 120s (1) cores 0.20/0.49 # Starting post_as_ho1 with 120s (1) cores 0.20/0.49 # ho_unfolding_3 with pid 14287 completed with status 0 0.20/0.49 # Result found by ho_unfolding_3 0.20/0.49 # Preprocessing class: HSMSSMSSMLMNHSN. 0.20/0.49 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.49 # Starting ho_unfolding_3 with 600s (5) cores 0.20/0.49 # No SInE strategy applied 0.20/0.49 # Search class: HGHNF-FFSF00-SHSSMFNN 0.20/0.49 # Scheduled 6 strats onto 5 cores with 600 seconds (600 total) 0.20/0.49 # Starting new_ho_10 with 325s (1) cores 0.20/0.49 # Starting ho_unfolding_3 with 61s (1) cores 0.20/0.49 # Starting ehoh_best_sine_rwall with 55s (1) cores 0.20/0.49 # Starting lpo1_def_fix with 55s (1) cores 0.20/0.49 # Starting ehoh_best8_lambda with 55s (1) cores 0.20/0.49 # ho_unfolding_3 with pid 14293 completed with status 0 0.20/0.49 # Result found by ho_unfolding_3 0.20/0.49 # Preprocessing class: HSMSSMSSMLMNHSN. 0.20/0.49 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.49 # Starting ho_unfolding_3 with 600s (5) cores 0.20/0.49 # No SInE strategy applied 0.20/0.49 # Search class: HGHNF-FFSF00-SHSSMFNN 0.20/0.49 # Scheduled 6 strats onto 5 cores with 600 seconds (600 total) 0.20/0.49 # Starting new_ho_10 with 325s (1) cores 0.20/0.49 # Starting ho_unfolding_3 with 61s (1) cores 0.20/0.49 # Preprocessing time : 0.001 s 0.20/0.49 # Presaturation interreduction done 0.20/0.49 0.20/0.49 # Proof found! 0.20/0.49 # SZS status Theorem 0.20/0.49 # SZS output start CNFRefutation 0.20/0.49 thf(decl_22, type, meq_ind: mu > mu > $i > $o). 0.20/0.49 thf(decl_23, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o). 0.20/0.49 thf(decl_24, type, mnot: ($i > $o) > $i > $o). 0.20/0.49 thf(decl_25, type, mor: ($i > $o) > ($i > $o) > $i > $o). 0.20/0.49 thf(decl_26, type, mand: ($i > $o) > ($i > $o) > $i > $o). 0.20/0.49 thf(decl_27, type, mimplies: ($i > $o) > ($i > $o) > $i > $o). 0.20/0.49 thf(decl_28, type, mimplied: ($i > $o) > ($i > $o) > $i > $o). 0.20/0.49 thf(decl_29, type, mequiv: ($i > $o) > ($i > $o) > $i > $o). 0.20/0.49 thf(decl_30, type, mxor: ($i > $o) > ($i > $o) > $i > $o). 0.20/0.49 thf(decl_31, type, mforall_ind: (mu > $i > $o) > $i > $o). 0.20/0.49 thf(decl_32, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o). 0.20/0.49 thf(decl_33, type, mexists_ind: (mu > $i > $o) > $i > $o). 0.20/0.49 thf(decl_34, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o). 0.20/0.49 thf(decl_35, type, mtrue: $i > $o). 0.20/0.49 thf(decl_36, type, mfalse: $i > $o). 0.20/0.49 thf(decl_37, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o). 0.20/0.49 thf(decl_38, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o). 0.20/0.49 thf(decl_39, type, mreflexive: ($i > $i > $o) > $o). 0.20/0.49 thf(decl_40, type, msymmetric: ($i > $i > $o) > $o). 0.20/0.49 thf(decl_41, type, mserial: ($i > $i > $o) > $o). 0.20/0.49 thf(decl_42, type, mtransitive: ($i > $i > $o) > $o). 0.20/0.49 thf(decl_43, type, meuclidean: ($i > $i > $o) > $o). 0.20/0.49 thf(decl_44, type, mpartially_functional: ($i > $i > $o) > $o). 0.20/0.49 thf(decl_45, type, mfunctional: ($i > $i > $o) > $o). 0.20/0.49 thf(decl_46, type, mweakly_dense: ($i > $i > $o) > $o). 0.20/0.49 thf(decl_47, type, mweakly_connected: ($i > $i > $o) > $o). 0.20/0.49 thf(decl_48, type, mweakly_directed: ($i > $i > $o) > $o). 0.20/0.49 thf(decl_49, type, mvalid: ($i > $o) > $o). 0.20/0.49 thf(decl_50, type, minvalid: ($i > $o) > $o). 0.20/0.49 thf(decl_51, type, msatisfiable: ($i > $o) > $o). 0.20/0.49 thf(decl_52, type, mcountersatisfiable: ($i > $o) > $o). 0.20/0.49 thf(decl_53, type, rel_s4: $i > $i > $o). 0.20/0.49 thf(decl_54, type, mbox_s4: ($i > $o) > $i > $o). 0.20/0.49 thf(decl_55, type, mdia_s4: ($i > $o) > $i > $o). 0.20/0.49 thf(decl_56, type, p: $i > $o). 0.20/0.49 thf(decl_57, type, q: $i > $o). 0.20/0.49 thf(decl_58, type, esk1_0: $i). 0.20/0.49 thf(decl_59, type, esk2_0: $i). 0.20/0.49 thf(decl_60, type, esk3_0: $i). 0.20/0.49 thf(decl_61, type, esk4_0: $i). 0.20/0.49 thf(mand, axiom, ((mand)=(^[X6:$i > $o, X7:$i > $o]:(mnot @ (mor @ (mnot @ X6) @ (mnot @ X7))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mand)). 0.20/0.49 thf(mnot, axiom, ((mnot)=(^[X6:$i > $o, X3:$i]:(~((X6 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mnot)). 0.20/0.49 thf(mor, axiom, ((mor)=(^[X6:$i > $o, X7:$i > $o, X3:$i]:(((X6 @ X3)|(X7 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mor)). 0.20/0.49 thf(mimplies, axiom, ((mimplies)=(^[X6:$i > $o, X7:$i > $o]:(mor @ (mnot @ X6) @ X7))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mimplies)). 0.20/0.49 thf(mequiv, axiom, ((mequiv)=(^[X6:$i > $o, X7:$i > $o]:(mand @ (mimplies @ X6 @ X7) @ (mimplies @ X7 @ X6)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mequiv)). 0.20/0.49 thf(mtransitive, axiom, ((mtransitive)=(^[X13:$i > $i > $o]:(![X15:$i, X16:$i, X17:$i]:((((X13 @ X15 @ X16)&(X13 @ X16 @ X17))=>(X13 @ X15 @ X17)))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mtransitive)). 0.20/0.49 thf(mvalid, axiom, ((mvalid)=(^[X6:$i > $o]:(![X3:$i]:((X6 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mvalid)). 0.20/0.49 thf(mbox_s4, axiom, ((mbox_s4)=(^[X6:$i > $o, X3:$i]:(![X14:$i]:((~((rel_s4 @ X3 @ X14))|(X6 @ X14)))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^5.ax', mbox_s4)). 0.20/0.49 thf(a2, axiom, (mtransitive @ rel_s4), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^5.ax', a2)). 0.20/0.49 thf(prove, conjecture, (mvalid @ (mimplies @ (mbox_s4 @ (mequiv @ p @ q)) @ (mbox_s4 @ (mequiv @ (mbox_s4 @ p) @ (mbox_s4 @ q))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', prove)). 0.20/0.49 thf(c_0_10, plain, ((mand)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(~((((~((Z0 @ Z2)))|(~((Z1 @ Z2))))))))), inference(fof_simplification,[status(thm)],[mand])). 0.20/0.49 thf(c_0_11, plain, ((mnot)=(^[Z0:$i > $o, Z1:$i]:(~((Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[mnot])). 0.20/0.49 thf(c_0_12, plain, ((mor)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((Z0 @ Z2)|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mor])). 0.20/0.49 thf(c_0_13, plain, ((mimplies)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimplies])). 0.20/0.49 thf(c_0_14, plain, ((mequiv)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(~((((~((((~((Z0 @ Z2)))|(Z1 @ Z2)))))|(~((((~((Z1 @ Z2)))|(Z0 @ Z2))))))))))), inference(fof_simplification,[status(thm)],[mequiv])). 0.20/0.49 thf(c_0_15, plain, ((mand)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(~((((~((Z0 @ Z2)))|(~((Z1 @ Z2))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_10, c_0_11]), c_0_12])). 0.20/0.49 thf(c_0_16, plain, ((mimplies)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_13, c_0_11]), c_0_12])). 0.20/0.49 thf(c_0_17, plain, ((mtransitive)=(^[Z0:$i > $i > $o]:(![X15:$i, X16:$i, X17:$i]:((((Z0 @ X15 @ X16)&(Z0 @ X16 @ X17))=>(Z0 @ X15 @ X17)))))), inference(fof_simplification,[status(thm)],[mtransitive])). 0.20/0.49 thf(c_0_18, plain, ((mequiv)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(~((((~((((~((Z0 @ Z2)))|(Z1 @ Z2)))))|(~((((~((Z1 @ Z2)))|(Z0 @ Z2))))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_14, c_0_15]), c_0_16])). 0.20/0.49 thf(c_0_19, plain, ((mvalid)=(^[Z0:$i > $o]:(![X3:$i]:((Z0 @ X3))))), inference(fof_simplification,[status(thm)],[mvalid])). 0.20/0.49 thf(c_0_20, plain, ((mbox_s4)=(^[Z0:$i > $o, Z1:$i]:(![X14:$i]:((~((rel_s4 @ Z1 @ X14))|(Z0 @ X14)))))), inference(fof_simplification,[status(thm)],[mbox_s4])). 0.20/0.49 thf(c_0_21, plain, ![X22:$i, X23:$i, X24:$i]:((((rel_s4 @ X22 @ X23)&(rel_s4 @ X23 @ X24))=>(rel_s4 @ X22 @ X24))), inference(apply_def,[status(thm)],[a2, c_0_17])). 0.20/0.49 thf(c_0_22, negated_conjecture, ~(![X30:$i]:((~(![X26:$i]:((~(rel_s4 @ X30 @ X26)|~((~((~(p @ X26)|(q @ X26)))|~((~(q @ X26)|(p @ X26))))))))|![X29:$i]:((~(rel_s4 @ X30 @ X29)|~((~((~(![X27:$i]:((~(rel_s4 @ X29 @ X27)|(p @ X27))))|![X28:$i]:((~(rel_s4 @ X29 @ X28)|(q @ X28)))))|~((~(![X28:$i]:((~(rel_s4 @ X29 @ X28)|(q @ X28))))|![X27:$i]:((~(rel_s4 @ X29 @ X27)|(p @ X27)))))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[prove]), c_0_16]), c_0_18]), c_0_19]), c_0_20])])). 0.20/0.49 thf(c_0_23, plain, ![X31:$i, X32:$i, X33:$i]:((~(rel_s4 @ X31 @ X32)|~(rel_s4 @ X32 @ X33)|(rel_s4 @ X31 @ X33))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])). 0.20/0.49 thf(c_0_24, negated_conjecture, ![X36:$i, X38:$i, X40:$i]:((((~(p @ X36)|(q @ X36)|~(rel_s4 @ esk1_0 @ X36))&(~(q @ X36)|(p @ X36)|~(rel_s4 @ esk1_0 @ X36)))&((rel_s4 @ esk1_0 @ esk2_0)&(((~(rel_s4 @ esk2_0 @ X40)|(q @ X40)|(~(rel_s4 @ esk2_0 @ X38)|(p @ X38)))&(((rel_s4 @ esk2_0 @ esk4_0)|(~(rel_s4 @ esk2_0 @ X38)|(p @ X38)))&(~(p @ esk4_0)|(~(rel_s4 @ esk2_0 @ X38)|(p @ X38)))))&(((~(rel_s4 @ esk2_0 @ X40)|(q @ X40)|(rel_s4 @ esk2_0 @ esk3_0))&(((rel_s4 @ esk2_0 @ esk4_0)|(rel_s4 @ esk2_0 @ esk3_0))&(~(p @ esk4_0)|(rel_s4 @ esk2_0 @ esk3_0))))&((~(rel_s4 @ esk2_0 @ X40)|(q @ X40)|~(q @ esk3_0))&(((rel_s4 @ esk2_0 @ esk4_0)|~(q @ esk3_0))&(~(p @ esk4_0)|~(q @ esk3_0))))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])])])). 0.20/0.49 thf(c_0_25, plain, ![X14:$i, X3:$i, X15:$i]:(((rel_s4 @ X3 @ X15)|~((rel_s4 @ X3 @ X14))|~((rel_s4 @ X14 @ X15)))), inference(split_conjunct,[status(thm)],[c_0_23])). 0.20/0.49 thf(c_0_26, negated_conjecture, ((rel_s4 @ esk2_0 @ esk4_0)|(rel_s4 @ esk2_0 @ esk3_0)), inference(split_conjunct,[status(thm)],[c_0_24])). 0.20/0.49 thf(c_0_27, negated_conjecture, ![X3:$i]:(((rel_s4 @ esk2_0 @ esk3_0)|(rel_s4 @ X3 @ esk4_0)|~((rel_s4 @ X3 @ esk2_0)))), inference(spm,[status(thm)],[c_0_25, c_0_26])). 0.20/0.49 thf(c_0_28, negated_conjecture, (rel_s4 @ esk1_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_24])). 0.20/0.49 thf(c_0_29, negated_conjecture, ![X3:$i]:(((q @ X3)|(rel_s4 @ esk2_0 @ esk3_0)|~((rel_s4 @ esk2_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_24])). 0.20/0.49 thf(c_0_30, negated_conjecture, ![X3:$i]:(((p @ X3)|~((q @ X3))|~((rel_s4 @ esk1_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_24])). 0.20/0.49 thf(c_0_31, negated_conjecture, ((rel_s4 @ esk1_0 @ esk4_0)|(rel_s4 @ esk2_0 @ esk3_0)), inference(spm,[status(thm)],[c_0_27, c_0_28])). 0.20/0.49 thf(c_0_32, negated_conjecture, ((rel_s4 @ esk2_0 @ esk3_0)|(q @ esk4_0)), inference(spm,[status(thm)],[c_0_29, c_0_26])). 0.20/0.49 thf(c_0_33, negated_conjecture, ((rel_s4 @ esk2_0 @ esk3_0)|~((p @ esk4_0))), inference(split_conjunct,[status(thm)],[c_0_24])). 0.20/0.49 thf(c_0_34, negated_conjecture, (rel_s4 @ esk2_0 @ esk3_0), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_31]), c_0_32]), c_0_33])). 0.20/0.49 thf(c_0_35, negated_conjecture, ![X3:$i]:(((q @ X3)|~((p @ X3))|~((rel_s4 @ esk1_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_24])). 0.20/0.49 thf(c_0_36, negated_conjecture, ![X3:$i]:(((rel_s4 @ X3 @ esk3_0)|~((rel_s4 @ X3 @ esk2_0)))), inference(spm,[status(thm)],[c_0_25, c_0_34])). 0.20/0.49 thf(c_0_37, negated_conjecture, ((rel_s4 @ esk2_0 @ esk4_0)|~((q @ esk3_0))), inference(split_conjunct,[status(thm)],[c_0_24])). 0.20/0.49 thf(c_0_38, negated_conjecture, ![X3:$i]:(((q @ X3)|~((rel_s4 @ esk2_0 @ X3))|~((q @ esk3_0)))), inference(split_conjunct,[status(thm)],[c_0_24])). 0.20/0.49 thf(c_0_39, negated_conjecture, ((q @ esk3_0)|~((p @ esk3_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_36]), c_0_28])])). 0.20/0.49 thf(c_0_40, negated_conjecture, ![X3:$i]:(((rel_s4 @ X3 @ esk4_0)|~((rel_s4 @ X3 @ esk2_0))|~((q @ esk3_0)))), inference(spm,[status(thm)],[c_0_25, c_0_37])). 0.20/0.49 thf(c_0_41, negated_conjecture, (~((p @ esk4_0))|~((q @ esk3_0))), inference(split_conjunct,[status(thm)],[c_0_24])). 0.20/0.49 thf(c_0_42, negated_conjecture, ![X3:$i, X14:$i]:(((q @ X3)|(p @ X14)|~((rel_s4 @ esk2_0 @ X3))|~((rel_s4 @ esk2_0 @ X14)))), inference(split_conjunct,[status(thm)],[c_0_24])). 0.20/0.49 thf(c_0_43, negated_conjecture, ![X3:$i]:(((q @ X3)|~((rel_s4 @ esk2_0 @ X3))|~((p @ esk3_0)))), inference(spm,[status(thm)],[c_0_38, c_0_39])). 0.20/0.49 thf(c_0_44, negated_conjecture, (~((q @ esk4_0))|~((q @ esk3_0))), inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_40]), c_0_28])]), c_0_41])). 0.20/0.49 thf(c_0_45, negated_conjecture, ![X3:$i]:(((q @ X3)|~((rel_s4 @ esk2_0 @ X3)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42, c_0_34]), c_0_43])). 0.20/0.49 thf(c_0_46, negated_conjecture, ~((q @ esk3_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44, c_0_45]), c_0_37])). 0.20/0.49 thf(c_0_47, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46, c_0_45]), c_0_34])]), ['proof']). 0.20/0.49 # SZS output end CNFRefutation 0.20/0.49 # Parsed axioms : 73 0.20/0.49 # Removed by relevancy pruning/SinE : 0 0.20/0.49 # Initial clauses : 51 0.20/0.49 # Removed in clause preprocessing : 37 0.20/0.49 # Initial clauses in saturation : 14 0.20/0.49 # Processed clauses : 64 0.20/0.49 # ...of these trivial : 0 0.20/0.49 # ...subsumed : 11 0.20/0.49 # ...remaining for further processing : 53 0.20/0.49 # Other redundant clauses eliminated : 0 0.20/0.49 # Clauses deleted for lack of memory : 0 0.20/0.49 # Backward-subsumed : 9 0.20/0.49 # Backward-rewritten : 12 0.20/0.49 # Generated clauses : 65 0.20/0.49 # ...of the previous two non-redundant : 59 0.20/0.49 # ...aggressively subsumed : 0 0.20/0.49 # Contextual simplify-reflections : 6 0.20/0.49 # Paramodulations : 65 0.20/0.49 # Factorizations : 0 0.20/0.49 # NegExts : 0 0.20/0.49 # Equation resolutions : 0 0.20/0.49 # Propositional unsat checks : 0 0.20/0.49 # Propositional check models : 0 0.20/0.49 # Propositional check unsatisfiable : 0 0.20/0.49 # Propositional clauses : 0 0.20/0.49 # Propositional clauses after purity: 0 0.20/0.49 # Propositional unsat core size : 0 0.20/0.49 # Propositional preprocessing time : 0.000 0.20/0.49 # Propositional encoding time : 0.000 0.20/0.49 # Propositional solver time : 0.000 0.20/0.49 # Success case prop preproc time : 0.000 0.20/0.49 # Success case prop encoding time : 0.000 0.20/0.49 # Success case prop solver time : 0.000 0.20/0.49 # Current number of processed clauses : 18 0.20/0.49 # Positive orientable unit clauses : 5 0.20/0.49 # Positive unorientable unit clauses: 0 0.20/0.49 # Negative unit clauses : 1 0.20/0.49 # Non-unit-clauses : 12 0.20/0.49 # Current number of unprocessed clauses: 9 0.20/0.49 # ...number of literals in the above : 26 0.20/0.49 # Current number of archived formulas : 0 0.20/0.49 # Current number of archived clauses : 35 0.20/0.49 # Clause-clause subsumption calls (NU) : 45 0.20/0.49 # Rec. Clause-clause subsumption calls : 40 0.20/0.49 # Non-unit clause-clause subsumptions : 20 0.20/0.49 # Unit Clause-clause subsumption calls : 12 0.20/0.49 # Rewrite failures with RHS unbound : 0 0.20/0.49 # BW rewrite match attempts : 7 0.20/0.49 # BW rewrite match successes : 3 0.20/0.49 # Condensation attempts : 64 0.20/0.49 # Condensation successes : 0 0.20/0.49 # Termbank termtop insertions : 3702 0.20/0.49 0.20/0.49 # ------------------------------------------------- 0.20/0.49 # User time : 0.007 s 0.20/0.49 # System time : 0.004 s 0.20/0.49 # Total time : 0.011 s 0.20/0.49 # Maximum resident set size: 1992 pages 0.20/0.49 0.20/0.49 # ------------------------------------------------- 0.20/0.49 # User time : 0.021 s 0.20/0.49 # System time : 0.013 s 0.20/0.49 # Total time : 0.034 s 0.20/0.49 # Maximum resident set size: 1800 pages 0.20/0.49 EOF